Metaheuristics for High School Timetabling

Hybridizing Integer Programming and Metaheuristics for Solving High School Timetabling

A SA-VNS approach for the High School Timetabling Problem

The High School Timetabling Problem consists in assigning timeslots and resources to events, satisfying constraints which heavily depend on the specific institution. This work deals with the problem of the ongoing III International Timetabling Competition (ITC), which includes a diverse set of instances from many educational institutions around the world. We proposed an approach based on Simula...

Integrating matheuristics and metaheuristics for timetabling

The High School Timetabling Problem requires the assignment of times and resources to events, while sets of required and desirable constraints must be considered. The most common approach for this problem is to employ metaheuristic methods. This work presents a matheuristic approach that combines a Variable Neighbourhood Search algorithm with mathematical programming-based neighbourhoods for hi...

An Integer Programming Model for the School Timetabling Problem

This work presents a binary integer programming model applied to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constraints of various types, known as school timetabling problem. Pairs of teachers and classes associated to timeslots are modeled as binary integer variables weighted by parameters referring to teachers p...

International Timetabling Competition A Hybrid Approach

This work arises from the research of the Metaheuristics Network on the University Course Timetabling Problem. In a first phase straightforward implementations of different metaheuristics were compared on a common local search framework [4]. In a second phase problem specific knoweldge was exploited and several alternatives for local search and metaheuristics were considered. Many possibilities...

A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem

The main goal of this paper is to attempt an unbiased comparison of the performance of straightforward implementations of five different metaheuristics on a university course timetabling problem. In particular, the metaheuristics under consideration are Evolutionary Algorithms, Ant Colony Optimization, Iterated Local Search, Simulated Annealing, and Tabu Search. To attempt fairness, the impleme...